- generalized vertex
- Макаров: обобщённая вершина (ктп)
Универсальный англо-русский словарь. Академик.ру. 2011.
generalized vertex
Смотреть что такое "generalized vertex" в других словарях:
Generalized n-gon — In combinatorial theory, a generalized n gon is an incidence structure introduced by Jacques Tits. Generalized polygons encompass as special cases projective planes (generalized triangles, n = 3) and generalized quadrangles ( n = 4), which form… … Wikipedia
Generalized Kac–Moody algebra — In mathematics, a generalized Kac–Moody algebra is a Lie algebra that is similar to a Kac–Moody algebra, except that it is allowed to have imaginary simple roots. Generalized Kac–Moody algebras are also sometimes called GKM… … Wikipedia
Monster vertex algebra — The monster vertex algebra is a vertex algebra acted on by the monster group that was constructed by Igor Frenkel, James Lepowsky, and Arne Meurman. R. Borcherds used it to prove the monstrous moonshine conjectures, by applying the no ghost… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Pythagorean theorem — See also: Pythagorean trigonometric identity The Pythagorean theorem: The sum of the areas of the two squares on the legs (a and b) equals the area of the square on the hypotenuse (c) … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
